#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int a[N];
ll solve() {
  cin >> n;
  rep(i, 1, n) cin >> a[i];
  int oc = 0, ec = 0;
  rep(i, 1, n) {
    if (a[i] & 1)
      oc++;
    else
      ec++;
  }
  if (oc == 0 || ec == 0) {
    int mx = *max_element(a + 1, a + n + 1);
    return mx;
  }
  ll sum = accumulate(a + 1, a + n + 1, 0ll);
  return sum - oc + 1;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cout << solve() << endl;
  }
  return 0;
}